Extracting the multiscale backbone of complex weighted networks
نویسندگان
چکیده
منابع مشابه
Extracting the multiscale backbone of complex weighted networks
A large number of complex systems find a natural abstraction in the form of weighted networks whose nodes represent the elements of the system and the weighted edges identify the presence of an interaction and its relative strength. In recent years, the study of an increasing number of large-scale networks has highlighted the statistical heterogeneity of their interaction pattern, with degree a...
متن کاملA two-stage algorithm for extracting the multiscale backbone of complex weighted networks
The central problem of concern to Serrano, Boguña and Vespignani [1] can be effectively and elegantly addressed using a well-established two-stage algorithm that has been applied to internal migration flows for numerous nations and several other forms of ”transaction flow data” [2, 3, 4]. In the first stage, the N row and N column sums of the N × N matrix of weighted, directed network flows (fi...
متن کاملExtracting the Globally and Locally Adaptive Backbone of Complex Networks
A complex network is a useful tool for representing and analyzing complex systems, such as the world-wide web and transportation systems. However, the growing size of complex networks is becoming an obstacle to the understanding of the topological structure and their characteristics. In this study, a globally and locally adaptive network backbone (GLANB) extraction method is proposed. The GLANB...
متن کاملThe hierarchical backbone of complex networks.
Given any complex directed network, a set of acyclic subgraphs can be extracted that will provide valuable information about its hierarchical structure. This Letter presents how the interpretation of the network weight matrix as a transition matrix allows the hierarchical backbone to be identified and characterized in terms of the concepts of hierarchical degree, which expresses the total weigh...
متن کاملMultiscale vulnerability of complex networks.
We present a novel approach to quantify the vulnerability of a complex network, i.e., the capacity of a graph to maintain its functional performance under random damages or malicious attacks. The proposed measure represents a multiscale evaluation of vulnerability, and makes use of combined powers of the links' betweenness. We show that the proposed approach is able to properly describe some ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2009
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.0808904106